A Generalization of Stanley’s Monster Reciprocity Theorem
نویسنده
چکیده
By studying the reciprocity property of linear Diophantine systems in light of Malcev-Neumann series, we present in this paper a new approach to and a generalization of Stanley’s monster reciprocity theorem. A formula for the “error term” is given in the case when the system does not have the reciprocity property. We also give a short proof of Stanley’s reciprocity theorem for linear homogeneous Diophantine systems.
منابع مشابه
On Stanley’s Reciprocity Theorem for Rational Cones
We give a short, self-contained proof of Stanley’s reciprocity theorem for a rational cone K ⊂ R. Namely, let σK(x) = ∑ m∈K∩Zd x m. Then σK(x) and σK◦(x) are rational functions which satisfy the identity σK(1/x) = (−1) σK◦(x). A corollary of Stanley’s theorem is the Ehrhart-Macdonald reciprocity theorem for the lattice-point enumerator of rational polytopes. A distinguishing feature of our proo...
متن کاملIrrational proofs for three theorems of Stanley
We give new proofs of three theorems of Stanley on generating functions for the integer points in rational cones. The first, Stanley’s Reciprocity Theorem, relates the rational generating function σv+K(x) := ∑ m∈v+K∩Z x m, where K is a rational cone and v ∈ R, with σ−v+K◦(1/x). The second, Stanley’s Positivity Theorem, asserts that the generating function of the Ehrhart quasipolynomial LP(n) :=...
متن کاملA Reciprocity Theorem for Monomer-Dimer Coverings
The problem of counting monomer-dimer coverings of a lattice is a longstanding problem in statistical mechanics. It has only been exactly solved for the special case of dimer coverings in two dimensions ((Kas61), (TF61)). In earlier work, Stanley (Sta85) proved a reciprocity principle governing the number N(m,n) of dimer coverings of an m by n rectangular grid (also known as perfect matchings),...
متن کاملThe matrix cover polynomial
The cover polynomial C(D) = C(D;x, y) of a digraph D is a twovariable polynomial whose coefficients are determined by the number of vertex coverings of D by directed paths and cycles. Just as for the Tutte polynomial for undirected graphs (cf. [11, 16]), various properties of D can be read off from the values of C(D;x, y). For example, for an n-vertex digraph D, C(D; 1, 0) is the number of Hami...
متن کاملEhrhart theory, modular flow reciprocity, and the Tutte polynomial
Given an oriented graph G, the modular flow polynomial φG(k) counts the number of nowhere-zero Zk-flows of G. We give a description of the modular flow polynomial in terms of (open) Ehrhart polynomials of lattice polytopes. Using Ehrhart–Macdonald reciprocity we give a combinatorial interpretation for the values of φG at negative arguments which answers a question of Beck and Zaslavsky (Adv Mat...
متن کامل